Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem
نویسندگان
چکیده
منابع مشابه
Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem
Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or r...
متن کاملA Branch and Price algorithm for the k-splittable maximum flow problem
The Maximum Flow Problem with flow width constraints is a NP-hard problem. Two models are proposed: the first model is a compact node-arc model using two flow conservation blocks per path. For each path, one block defines the path while the other one send the right amount of flow on it. The second model is an extended arc-path model. It is obtained from the first model after a Dantzig-Wolfe ref...
متن کاملComparing Algorithms for Minimizing Congestion and Cost in the Multi-Commodity k-Splittable Flow
In the k-splittable flow problem, each commodity can only use at most k paths and the key point is to find the suitable transmitting paths for each commodity. To guarantee the efficiency of the network, minimizing congestion is important, but it is not enough, the cost consumed by the network is also needed to minimize. Most researches restrict to congestion or cost, but not the both. In this p...
متن کاملComparing Branch-and-price Algorithms for the Unsplittable Multicommodity Flow Problem
In this paper we address branch-and-price algorithms for the unsplittable multicommodity flow problem. This problem is defined over a capacitated network in which we intend to route a set of commodities, each one with a given origin, destination and demand, at minimal cost, without exceeding the arc capacities. Furthermore, the flow of each commodity must be routed using a single path. Formulat...
متن کاملOn the k-Splittable Flow Problem
In traditional multi-commodity flow theory, the task is to send a certain amount of each commodity from its start to its target node, subject to capacity constraints on the edges. However, no restriction is imposed on the number of paths used for delivering each commodity; it is thus feasible to spread the flow over a large number of different paths. Motivated by routing problems arising in rea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2012
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2011.10.001